Reduced Kronecker products which are multiplicity free or contain only few components
نویسندگان
چکیده
منابع مشابه
On Kronecker Products of Characters of the Symmetric Groups with Few Components
Confirming a conjecture made by Bessenrodt and Kleshchev in 1999, we classify all Kronecker products of characters of the symmetric groups with only three or four components. On the way towards this result, we obtain new information about constituents in Kronecker products.
متن کاملHyperspaces which are products or cones
Let C(X) be the hyperspace of all subcontinua of a metric continuum X. Alejandro Illanes has proved that C(X) is a finitedimensional Cartesian product if and only if X is an arc or a circle. In this paper we shall prove, using the inverse systems and limits, that if X is a non-metric rim-metrizable continuum and C(X) is a finitedimensional Cartesian product, then X is a generalized arc or a gen...
متن کاملMultilinear forms which are products of linear forms
The conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. Also we generalize a result due to S.Kurepa for 2n-functionals in a group G.
متن کاملMultiplicity-Free Products of Schur Functions
We classify all multiplicity-free products of Schur functions and all multiplicity-free products of characters of SL(n; C). 0. Introduction In this paper, we classify the products of Schur functions that are multiplicity-free; i.e., products for which every coeecient in the resulting Schur function expansion is 0 or 1. We also solve the slightly more general classiication problem for Schur func...
متن کاملfinite groups which are the products of symmetric or alternating groups with $l_3(4)$
in this paper, we determine the simple groups $g=ab$, where $b$ is isomorphic to $l_{3}(4)$ and $a$ isomorphic to an alternating or a symmetric group on $ngeq5$, letters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2010.05.008